Serial Concatenation and Joint Iterative Decoding of LDPC Codes and Reed-Solomon Codes
نویسندگان
چکیده
In this paper, a serial concatenation scheme and its iterative decoding algorithm between Low Density Parity Check codes (LDPC) and Reed-Solomon codes are proposed. For the decoder, the soft output values delivered by LDPC are used as reliability values to perform the Chase decoding of Reed-Solomon (RS) codes which return soft information to LDPC decoder. This approach presents an option scheme for LDPC with short and medium length because of the relevant presence of short loops. It allows to bridge the gap between error performance and maximum likelihood decoding. Simulation result for the scheme is given and elaborated.
منابع مشابه
Reduced-Complexity Decoding of Low Density Parity Check Codes for Generalized Partial Response Channels
The performance of low-density parity-check (LDPC) codes serially concatenated with generalized partial response channels is investigated. Various soft-input/soft-output detection schemes suitable for use in iterative detection/decoding systems are described. A low-complexity near-optimal detection algorithm that incorporates soft-input reliability information and generates soft-output reliabil...
متن کاملDevelopment and Verification of Iterative Decoder for LDPC-RS Product Codes
LDPC codes provide good random error performance nearer to Shannon limit. The LDPC codes have some residue errors which cannot be corrected even after large number of iterations such errors can be corrected by concatenating LDPC codes with RS codes. This paper describes the development of an iterative decoder scheme for LDPC-RS product codes which made LDPC codes and Turbo codes popular. The it...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملRandom error and burst correction by iterated codes
Error-correcting codes have contributed in a significant way for both the theoretical referred to as random errors, or else errors can appear in bursts of many errors each It was shown that long LDPC codes with iterative decoding achieve. LDPC codes provide good random error performance nearer to Shannon limit. iterations such errors can be corrected by concatenating LDPC codes with RS codes. b...
متن کاملThe design of structured regular LDPC codes with large girth
This paper introduces three new classes of structured regular (n, 2, k) LDPC codes with girth 12, 16, and 20, respectively. These codes are systematically constructed, well structured, and have uniform row and column weights, which make them able to greatly simplify the implementation of LDPC coders. Their large girth improves their decoding performance. Simulation results compare their bit err...
متن کامل